A New Logarithmic Normalization Method in Games Theory
نویسندگان
چکیده
منابع مشابه
A New Logarithmic Normalization Method in Games Theory
Multi-criteria decision making is used in many areas of human activities. Each alternative in multi-criteria decision making problem can be described by a set of criteria. Criteria can be qualitative and quantitative. They usually have different units of measurement and different optimization direction. The normalization aims at obtaining comparable scales of criteria values. The normalization ...
متن کاملA New Method in Bankruptcy Assessment Using DEA Game Theory
One of the most important economic concepts is evaluation and bankruptcy prediction. Financial events, which an organization could be, exposed to serious risks and it goes bankruptcy. Therefore, prediction and assessment bankruptcy enable organizations that to be familiar the financial risks and resolve their financial deficiencies. So in this paper, we discuss one of the most important economi...
متن کاملsolution of security constrained unit commitment problem by a new multi-objective optimization method
چکیده-پخش بار بهینه به عنوان یکی از ابزار زیر بنایی برای تحلیل سیستم های قدرت پیچیده ،برای مدت طولانی مورد بررسی قرار گرفته است.پخش بار بهینه توابع هدف یک سیستم قدرت از جمله تابع هزینه سوخت ،آلودگی ،تلفات را بهینه می کند،و هم زمان قیود سیستم قدرت را نیز برآورده می کند.در کلی ترین حالتopf یک مساله بهینه سازی غیر خطی ،غیر محدب،مقیاس بزرگ،و ایستا می باشد که می تواند شامل متغیرهای کنترلی پیوسته و گ...
A New Class of Zero-Inflated Logarithmic Series Distribution
Through this paper we suggest an alternative form of the modified zero-inflated logarithmic series distribution of Kumar and Riyaz (Statistica, 2013) and study some of its important aspects. The method of maximum likelihood is employed for estimating the parameters of the distribution and certain test procedures are considered for testing the significance of the additional parameter of the model. ...
متن کاملA logarithmic approximation for polymatroid congestion games
We study the problem of computing a social optimum in polymatroid congestion games, where the strategy space of every player consists of a player-specific integral polymatroid base polyhedron on a set of resources. For non-decreasing cost functions we devise an Hρ-approximation algorithm, where ρ is the sum of the ranks of the polymatroids and Hρ denotes the ρ-th harmonic number. The approximat...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Informatica
سال: 2008
ISSN: 0868-4952,1822-8844
DOI: 10.15388/informatica.2008.215